A Hyperheuristic for the Dial-a-Ride Problem with Time Windows

On the Online Dial-A-Ride Problem with Time-Windows

In this paper the first results on the Online Dial-A-Ride Problem with Time-Windows (ODARPTW for short) are presented. Requests for rides appearing over time consist of two points in a metric space, a source and a destination. Servers transport objects of requests from sources to destinations. Each request specifies a deadline. If a request is not be served by its deadline, it will be called of...

Improving Techniques for an On-line Dial-a-ride Problem with Time Windows and Capacity Constraints

Applying Genetic Algorithms To The Dial-A-Ride Problem With Time Windows

The Dial-a-ride problem with time windows (DARPTW) assigns and schedules users transport requests to a fleet of vehicles enabled to fulfill the required service. The literature offers different heuristics for solving DARPTW problems, which are based on the extension of traditional graph search algorithms. On the other hand, the approach through Genetic Algorithms (GA) has been experienced in pr...

The Dial-A-Ride Problem with Transfers

The Dial–A–Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT invo...

Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors

The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the DARP can also be used to organize usual passenger or goods transportation in real online scenarios with time window constraints. This paper presents an efficient exact algorithm with significantly reduced calculation ...